Difference-preserving codes
نویسندگان
چکیده
منابع مشابه
Difference-Preserving Process Merge
Providing merging techniques for business processes fosters the management and maintenance of (large) process model repositories. Contrary to existing approaches that focus on preserving behavior of all participating process models, this paper presents a merging technique that aims at preserving the difference between the participating process models by exploiting the existence of a common pare...
متن کاملStructure-Preserving Difference Search for XML Documents
Current XML differencing applications usually try to find a minimal sequence of edit operations that transform one XML document to another XML document (the so-called "edit script"). In our conviction, this approach often produces increments that are unintuitive for human readers and do not reflect the actual changes. We therefore propose in this article a different approach trying to maximise ...
متن کاملPositivity-preserving nonstandard finite difference Schemes for simulation of advection-diffusion reaction equations
Systems in which reaction terms are coupled to diffusion and advection transports arise in a wide range of chemical engineering applications, physics, biology and environmental. In these cases, the components of the unknown can denote concentrations or population sizes which represent quantities and they need to remain positive. Classical finite difference schemes may produce numerical drawback...
متن کاملQuasi-cyclic LDPC codes from difference families
We consider in this paper regular and nearly regular quasi-cyclic low-density paritycheck (LDPC) codes, derived from families of difference sets. The codes have girth at least 6, and sparse parity-check matrices. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding.
متن کاملDifference Sets and Codes in $ A_n $ Lattices
This paper presents a geometric/coding theoretic interpretation of planar difference sets and the corresponding reformulations of two important conjectures in the field. It is shown that such sets of order n exist if and only if theAn lattice admits a lattice tiling by balls of radius 2 under l1 metric (i.e., a linear 2-perfect code). More general difference sets and perfect codes of larger rad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1974
ISSN: 0018-9448
DOI: 10.1109/tit.1974.1055267